Method for determining a value of an integer scaling in a linking of input sets to output sets, and computer program product

ABSTRACT

The invention relates to a method for determining a value of an integer scaling in a linking of input sets to output sets, wherein the linking comprises operators, each of which has operator inputs and operator outputs that are at least partially linked to one another or to the input sets or to the output sets, by using a computer device having a processing unit, a memory unit, and an output unit. Representations of set objects are used to efficiently carry out rescaling operations within the linking, with up to infinitely large resolution sets. This procedure makes it possible to calculate resource-conserving integer scalings for a target system while taking secondary conditions into account.

The invention relates to a method for determining a value of an integer scaling in a linking of input sets to output sets according to the preamble of Claim 1. The invention further relates to a computer program product according to Claim 10.

For resource-related reasons, fixed-point implementations are used instead of floating-point implementations for real-time calculations, for example for physical calculations that are to be carried out in control and/or regulation systems. One particularly important application relates to the computer programs or software in control devices for drives of motor vehicles.

The conversion of floating-point implementations into fixed-point implementations for code generation presently generally requires a high time expenditure for implementation and testing. Programming tools usually provide little assistance in this process. A procedure that uses manual calculations and frequent trials involves the risk of an insufficiently systematic approach and susceptibility to errors, with the unpleasant consequence that errors are possibly not discovered until later, during the development process.

Known programming tools allow a semiautomatic fixed-point implementation (integer scaling) based on recorded or simulated signal patterns. The Fixed-Point Advisor program from MathWorks, Inc., Natick, Mass., US, is such a programming tool. The document U.S. Pat. No. 9,436,442 B1 describes methods and systems that enable a programmer to convert a model of a dynamic system with floating-point implementation, based on a higher-level programming language, into a code with fixed-point implementation that can be executed on a processor or a logic gate. In the cited document, the application of the dynamic system is simulated, so that simulated value ranges for floating-point variables are obtained, and the dynamic system is statically analyzed to obtain static value ranges for floating-point variables. Based on these value ranges, types of fixed-point variables are determined in an automated manner and used in the generation of a code.

In practice, use of the application has shown that quite large data volumes that are determined by measurement or are simulated must be available with suitable quality; however, generating these data, presuming adequate signal coverage (which is usually difficult to determine) may involve a high level of effort. In the event of revisions, it may be necessary to generate the data volumes anew, and peripheral areas may possibly not be captured. The quality of the solution is highly dependent on the quality of the data.

The document DE 100 56 047 C1 relates to a method and a computer device for converting an arithmetic expression of floating-point arithmetic into fixed-point arithmetic. According to the cited document, normalization factors are determined for the variables of the floating-point expression. In order to generate a fixed-point expression that has preferably compact program code and a short run time, the normalization factors are summarized to form constants by multiplication and/or division, so that the number of constants is minimal. The number of operations to be processed for executing the fixed-point expression is reduced by means of optimization algorithms.

In practice, it has been shown that inaccuracies in the physical representation may occur, since the integer scalings that are carried out are not based on physical representations. The underlying method concentrates on local phenomena, so that significant manual follow-up work must be performed as soon as the overall model is considered. The resolutions are preset at defined locations by the user of the programming tool, so that there is a risk of encountering settings at various locations that are incompatible with one another. Eliminating these application errors may require laborious review of the code and an iterative procedure. The quality of the solution therefore varies significantly, depending on the expert knowledge of the programmer.

To eliminate the stated disadvantages, manual review of the generated code is generally performed in order to identify indicators for physical deviations or a high expenditure of resources. The programmers make do with an iterative procedure based on expert knowledge and best practice examples in order to eliminate possible problems in the future or to speed up the execution of the generated code. The quality of the physical representation of the integer-scaled model remains to be tested.

It is therefore desirable to be able to make a determination of an integer scaling, also referred to as a resolution, in a model, referred to below as linking, based on the complete and/or overall physical requirements in one method pass, while avoiding or mitigating at least one of the described disadvantages.

The object of the present invention is to carry out an integer scaling for a linking based on the physical requirements, without the need for resorting to data that are simulated or determined by measurement.

This object is achieved according to the invention by a method for determining a value of an integer scaling in a linking of input sets and output sets, having the features according to Claim 1. Advantageous refinements of the invention are characterized in the dependent claims. The features individually set forth in the patent claims may be combined with one another in a technologically meaningful manner, and may be supplemented by the explanatory material from the description and/or details from the figures, which indicate further embodiment variants of the invention.

In the method according to the invention, (at least) one value of an integer scaling, also referred to as a resolution, (at a location) in a linking, also referred to as a model, of input sets to output sets is determined. The linking comprises operators, each of which has operator inputs and operator outputs that are at least partially linked to one another or to the input sets or to the output sets.

According to the invention, a computer device having a processing unit, a memory unit, and an output unit is utilized. In each case a representation of the effect of each of the operators on the particular integer scaling of its operator inputs is provided, in particular in the memory unit, for generating the particular integer scaling of its operator outputs. In the method according to the invention, for each input set, each operator input, each operator output, and each output set, an initial representation of the set of all allowed integer scalings and a representation of a rescaling of an integer scaling to a set of all integer scalings, which are achievable by allowable transformations, are stored in each case in the memory unit. The initial representations of the input sets are propagated forward through the linking, so that for each operator input, for each operator output, and for each output set, a representation of the set of all possible integer scalings is generated in the processing unit. According to the connections in the linking, and consistent with the initial representations (for each operator output, each operator input, and each output set), for each translation of an input set to an operator input, the representation of the rescaling (to the representation of the input set) is applied, for each translation of an operator output to an operator input or to an output set, the representation of the rescaling (to the representation of the operator output) is applied, and for each operator, the representation of its effect is applied. One element from one of the generated sets is specified as the value of the integer scaling, based on a selection that is made in an automated manner in the processing unit, and (at least) the specified value is output in the output unit.

Stated summarily in a straightforward manner, in the method according to the invention complete sets of scalings that are possible at locations in the linking are processed in parallel and reduced to a subset thereof, or more precisely, to a selection of mutually consistent scalings at the locations, in a particularly advantageous manner. For this purpose, representations of abstract or abstracted set objects are used in the method according to the invention. In other words, the method according to the invention allows a complete, requirements-based, efficient determination of all relevant resolutions and rescaling variants in any given combination. Due to the underlying overall consideration of the linking, the method provides a high-quality result.

The method according to the invention allows a fixed-point scaling based on the physical requirements, without the need for finding data that are determined by simulation or measurement. In the procedure according to the invention, it is particularly advantageous that as a whole, instead of determining the solution based on only one location, in particular optimization is achieved. As a result, the method is particularly efficient. The method implements requirements with which the characteristics of the calculated resolutions, the physical representational accuracy of the generated integer model, the quantity of available bit space, and/or the balance between an implementation on the target system that favors memory and an implementation that favors run time, may be controlled. In addition, the method allows the integer scaling of portions of the linking in the context of an environment that is modifiable only in portions.

Input sets, operator inputs and operator outputs, and output sets form locations (pins) in the linking. The input sets and the output sets are in each case integer-scaled and/or represented as sets for fixed-point arithmetic.

An allowed integer scaling for a location is an integer scaling that lies within an enveloping interval for integer scalings at this location and/or is fixed or limited as a criterion of the integer scaling. In this way, resolution limits, which may optionally be calculated or set in advance, are advantageously taken into account in order to include, for example, minimum bit widths and/or minimum accuracies in the integer scaling.

In the context of the invention, the input sets may also be exactly one input set. In the context of the invention, the output sets may also be exactly one output set. In the context of the invention, the operators may also be exactly one operator. An operator may have exactly one operator input and/or exactly one operator output. In other words, the plurality used in the context of the invention for the definition and the description also includes the singularity of the particular features.

For those skilled in the art, it is immediately and unambiguously clear that the linking is or may be inverted. This means that the sets designated as input sets may also be output sets, and the sets designated as output sets may also be input sets, in which case the portions designated as operators each represent respective inverse operators in the linking. In other words, of the two directions in the linking, for those skilled in the art, which direction is the forward direction and which is the backward direction depends on the particular specific relationship. A linking, in particular in an application, may also always be used in the backward direction, or may be intended for use in the backward direction.

In the method according to the invention, in one preferred embodiment the forward propagation comprises each representation obtained in one of the translations at an operator input being intersected with the (initial or instantaneous) representation at this operator input, each representation obtained by operator application at an operator output being intersected with the (initial or instantaneous) representation at this operator output, and each representation obtained for an output set being intersected with the (initial or instantaneous) representation of this output set. An instantaneous representation is the representation obtained from a preceding propagation step. A propagation may also be referred to as a propagation.

In practice, it has been found that in the method according to the invention, representations that are based on prime factor sets having a finite number or an infinite number of prime factor combinations may be used in a particularly advantageous manner. In particular, the representations are composed of union sets of sets of quotients from elements of prime factor sets.

Furthermore, in advantageous embodiments of the method according to the invention, after the forward propagation and prior to the determination of an element, the generated representations of the output sets are propagated backward through the linking, so that for each operator input, for each operator output, and for each input set, a representation of the set of all possible integer scalings is generated in the processing unit. According to the connections in the linking, and consistent with the representations obtained in the forward propagation, for each translation of an output set to an operator output, the representation of the inverse rescaling is applied, and for each translation of an operator input to an operator output or to an input set, the representation of the inverse rescaling is applied, and for each operator, the representation of its inverse effect is applied. In particular, the representations generated by forward propagation may be compared to the representations generated by backward propagation, and a further forward propagation is carried out if a backward propagation most recently took place, or a further backward propagation is carried out if a forward propagation most recently took place, until the representations generated by the most recent forward propagation no longer differ from the representations generated by the most recent backward propagation. Stability of the obtained solution is thus achieved in an advantageous manner.

In one advantageous refinement, the method according to the invention may be iterated for determining a value of an integer scaling at another location in the linking: As an alternative or in addition to the described steps, in embodiments of the method according to the invention, after the element is determined from the one generated set, the generated representation of the set may be projected onto the representation of the element. Then, based on the other generated representations and the representation of the element, at least one, in particular one or more, new propagation(s), in particular a forward propagation and/or a backward propagation, may be carried out. Lastly, a further element from one of the other sets that is generated after, in particular immediately after, this new propagation, in particular forward propagation and/or backward propagation, may be fixed as the value of the integer scaling at another location in the linking, based on a selection that is made in an automated manner in the processing unit, and (at least) the fixed further value is output in the output unit.

The setting may be made after exactly one of the stated forward propagations, or after one or more further forward propagations and/or backward propagations. In particular, it is preferred that stability is or has once again been achieved.

In one alternative or additional refinement of embodiments of the method according to the invention, the selection that is made in an automated manner in the processing unit may comprise the elements of the generated set of the integer scalings being assessed with a cost function, and the element to be selected being determined based on its associated costs. The cost function is preferably based on the processing time for computing operations for rescaling steps. In this way, a particularly preferred element, for example one that has a short computing time during a rescaling, or a certain resolution or integer scaling may be selected for a subsequent implementation of the linking in an application.

Additionally or alternatively, embodiments of the method according to the invention may be supplemented by selecting allowable transformations from a set of possible transformations, in particular in an automated manner, before the representation of the rescaling of an integer scaling is created or selected for the set of all integer scalings, and then storing them in the memory.

A computer program product is also part of the inventive concept.

The computer program product according to the invention may be loaded directly into the internal memory of a computer, and includes software code sections with which a method having features or feature combinations according to the present description is carried out when the computer program product runs on the computer. In specific embodiments, the computer program product according to the invention may be disseminated in particular on a data medium, for example a CD, a DVD, or a memory stick, or by transmission starting from a computer. In other specific embodiments, the computer program product according to the invention, starting from a local computer that is linked to a remote computer, may be executed on the remote computer.

Further advantages and advantageous embodiments and refinements of the invention are set forth based on the following description, with reference to the figures, which show the following:

FIG. 1 shows an example of forward transformation of a QSet object,

FIG. 2 shows an example of linking, and

FIG. 3 shows a flow chart of one particularly advantageous embodiment of the method according to the invention.

Before describing one particularly advantageous embodiment of the method according to the invention, with reference to the figures and with the aid of one specific linking example, in order to form the basis, domain-specific set objects are first described whose representations are used according to the invention in the scaling method.

Firstly, the abstract set objects that are directed to the “integer scaling” problem domain, which form the framework of the scaling method, are defined.

A prime factor set object (hereinafter PSet object) maps a set of possible prime factor combinations. A distinction is made between three variants of these set objects. The variants together with their parameters form an abstraction of prime factorizations. A PSet object, depending on its variant, represents either a finite number or an infinite number of prime factor combinations.

The set PSet_(C) is a finite set that has one element, and that describes a specific prime factor combination and forms a first variant. It is defined by

${{PSet}_{C}(\beta)} = {{{PSet}_{C}\left( {{a_{1\;}\ldots \mspace{11mu} a_{n}},{e_{1}\ldots \mspace{11mu} e_{n}}} \right)}:={\left\{ {\left. {x \in {\mathbb{N}}}\; \middle| x \right. = {\prod\limits_{i = 1}^{n}\; a_{i}^{e_{i}}}} \right\}:=\left\{ \beta \right\}}}$

with the prime numbers α_(l) ∈

and the exponents e_(l) ∈

₀. The PSet_(C) object describes a finite set having one element, the value of this element being base β=Π_(i=1) ^(n) α_(l) ^(e) ^(i) with β∈

. Since each natural number has a unique prime factorization, the value β∈

is sufficient to completely describe the PSet_(C) object.

Examples of PSet_(C) sets are presented in the following table:

PSet_(C) Set elements PSet_(C0)(3¹ · 5¹ · 13¹) = PSet_(C0)(195) { 3¹ · 5¹ · 13¹} PSet_(C1)(3¹ · 5³) = PSet_(C0)(375) { 3¹ · 5³} PSet_(C2)(7² · 11¹) = PSet_(C0)(539) {7² · 11¹}

A fixed prime factor base combination β is likewise defined for the object PSet_(R). The elements of the PSet_(R) set are formed in each case by taking different factors from an extended set Ψ and multiplying by the base β, resulting in

$\begin{matrix} {{{PSet}_{R}\left( {\beta,\Psi} \right)} = {{PSet}_{R}\left( {{a_{1}\ldots \mspace{11mu} a_{n}},{e_{1}\ldots \; e_{n}},{b_{1}\ldots \; b_{m}},{k_{1,\max}\mspace{11mu} \ldots \; k_{m,\max}}} \right)}} \\ {:=\left\{ {\left. {x \in {\mathbb{N}}} \middle| x \right. = {{\prod\limits_{i = 1}^{n}\; {a_{i}^{e_{i}} \cdot {\prod\limits_{j = 1}^{m}\; {b_{j}^{k_{j}}\bigwedge k_{j}}}}} \leq k_{j,\max}}} \right\}} \\ {:=\left\{ {\left. {x \in {\mathbb{N}}} \middle| x \right. = {{\beta \cdot {\psi\bigwedge\psi}} \in \Psi}} \right\}} \end{matrix}$

with a_(i), b_(j) ∈

and e_(i), k_(j)∈

₀, and for the base β and the extended set Ψ,

${\Psi \left( {{b_{1}\ldots \; b_{m}},{k_{1,\max}\; \ldots \; k_{m,\max}}} \right)}:={\left\{ {\left. {x \in {\mathbb{N}}} \middle| x \right. = {{\prod\limits_{j = 1}^{m}\; {b_{j}^{k_{j}}\bigwedge k_{j}}} \leq k_{j,\max}}} \right\}.}$

The extended set Ψ may be completely described by its maximum value

${\overset{\sim}{\Psi} = {\prod\limits_{j = 1}^{m}\; b_{j}^{k_{j,\max}}}},{\overset{\sim}{\Psi} \in {\mathbb{N}}}$

since the prime factor bases b_(j) ∈

as well as the exponents k_(j,max) ∈

₀ may be unambiguously determined by prime factorizaton. Thus, the following applies: PSet_(R)=f(β,Ψ({tilde over (Ψ)}))=f(β,{tilde over (Ψ)}).

These sets form a second variant with a restrictively expandable base value.

Examples of PSet_(R) sets are presented in the following table:

PSet_(R) Set elements PSet_(R0)(3¹ · 5¹, 13²) = PSet_(R0)(15, 169) { 3¹ · 5¹ · 13⁰, 3¹ · 5¹ · 13¹, 3¹ · 5¹ · 13²} PSet_(R1)(3¹ · 5¹, 2¹ · 3¹) = PSet_(R1)(15, 6) { 3¹ · 5¹ · 2⁰ · 3⁰, 3¹ · 5¹ · 2⁰ · 3¹, 3¹ · 5¹ · 2¹ · 3⁰, 3¹ · 5¹ · 2¹ · 3¹} PSet_(R2)(1¹, 7² · 11¹) = PSet_(R2)(1, 539) {7⁰ · 11⁰, 7⁰ · 11¹, 7¹ · 11⁰, 7¹ · 11¹, 7² · 11⁰, 7² · 11¹}

The PSet_(U) sets are a third variant having a base element with unlimited expandability. A fixed base component β∈

is again used for the PSet_(U) set. The elements of the set result from expanding the base component by an arbitrary number of prime factors.

The PSet_(U) set is defined as

$\begin{matrix} {{{PSet}_{U}(\beta)} = {{PSet}_{U}\left( {{a_{1}\ldots \mspace{11mu} a_{n}},{e_{1}\ldots \; e_{n}}} \right)}} \\ {:=\left\{ {\left. {x \in {\mathbb{N}}} \middle| x \right. = {{\prod\limits_{i = 1}^{n}\; {a_{i}^{e_{i}} \cdot {\prod\limits_{j = 1}^{m}\; {b_{j}^{k_{j}}\bigwedge b_{j}}}}} \in {{\mathbb{P}}\bigwedge k_{j}} \in {\mathbb{N}}_{0}}} \right\}} \\ {:=\left\{ {\left. {x \in {\mathbb{N}}} \middle| x \right. = {{\beta \cdot {\chi\bigwedge\beta}} = {{\prod\limits_{i = 1}^{n}{a_{i}^{e_{i}}\bigwedge\chi}} \in X}}} \right\}} \end{matrix}$

with the constant base β∈

, the prime factors α_(i) ∈

, the positive exponents e_(i)∈

₀, and the infinitely large overall factor set X,

$X:={\left\{ {\left. {x \in {\mathbb{N}}} \middle| x \right. = {{\prod\limits_{j = 1}^{m}\; {b_{j}^{k_{j}}\bigwedge b_{j}}} \in {{\mathbb{P}}\bigwedge k_{j}} \in {\mathbb{N}}_{0}}} \right\}.}$

The overall factor set X maps all existing combinations of prime factors having positive exponents. It is not specific for the particular PSet_(U) object, and therefore is not a parameter.

Examples of PSet_(U) sets are illustrated in the following table:

PSet_(U) Set elements PSet_(U0)(1¹) = PSet_(U0)(1) {1¹, 2¹, 3¹, 2², 5¹, 2² · 3¹, 7¹, . . .} PSet_(U1)(3¹) = PSet_(U1)(3) { 3¹, 2¹ · 3¹, 3², 2² · 3¹, 3¹ · 5¹, . . .} PSet_(U2)(3¹ · 5¹) = { 3¹ · 5¹, 2¹ · 3¹ · 5¹, 3² · 5¹, 2² · 3¹ · 5¹, . . .} PSet_(U2)(15)

The described variants of a PSet object, together with the variant-based parameters, form an abstraction of prime factor combinations having positive exponents. Each PSet set may be completely characterized via its variant and the associated parameters in the form of natural numbers (β, {tilde over (Ψ)} in the case of PSet_(R), and β in the case of PSet_(C), PSet_(U)).

Various operations, in particular intersection and multiplication operations, are possible on the PSet sets. Each of these operations gives a result of either exactly one PSet set object or an empty set. The operations in question are defined below. They form the basis for subsequently generating abstract resolution sets from PSet objects.

An operation PSet_(0·1)=PSet₀·PSet₁ which calculates the product of any two given PSet set objects is defined as a PSet product. The result set contains the products of each element of the set PSet₀ and each element of the set PSet₁. The definitions of the PSet product for the various variants are provided in the following table:

Result matrix product PSet_(C1) PSet_(R1) PSet_(U1) PSet_(C0) PSet_(C)(β₀ · β₁) PSet_(R)(β₀ · β₁, {tilde over (Ψ)}₁) PSet_(U)(β₀ · β₁) PSet_(R0) PSet_(R)(β₀ · β₁, {tilde over (Ψ)}₀) PSet_(R)(β₀ · β₁, {tilde over (Ψ)}₀ · {tilde over (Ψ)}₁) PSet_(U)(β₀ · β₁) PSet_(U0) PSet_(U)(β₀ · β₁) PSet_(U)(β₀ · β₁) PSet_(U)(β₀ · β₁)

An operation PSet_(0∩1)=PSet₀∩PSet₁ that forms the intersecting set of any two given PSet set objects is defined as a PSet intersecting set. The result of the operation is either a PSet object or an empty set { }. The definitions of the PSet intersecting set for the various variants are provided in the following table:

Result matrix intersection PSet_(C1) PSet_(C0) $\quad\left\{ \begin{matrix} {{{PSet}_{C}\left( \beta_{0} \right)},} & {\beta_{0} = \beta_{1}} \\ {{\{\}},} & {otherwis} \end{matrix} \right.$ PSet_(R0) $\quad\left\{ \begin{matrix} {{{PSet}_{C}\left( \beta_{1} \right)},} & {\left\lbrack {\beta_{0}\overset{\sim}{\subseteq}\beta_{1}} \right\rbrack\bigwedge\left\lbrack {\beta_{1}\overset{\sim}{\subseteq}\left( {\beta_{0} \cdot {\overset{\sim}{\Psi}}_{0}} \right)} \right\rbrack} \\ {{\{\}},} & {otherwis} \end{matrix} \right.$ PSet_(U0) $\quad\left\{ \begin{matrix} {{{PSet}_{C}\left( \beta_{1} \right)},} & {\beta_{0}\overset{\sim}{\subseteq}\beta_{1}} \\ {{\{\}},} & {otherwis} \end{matrix} \right.$ Result matrix intersection PSet_(R1) PSet_(C0) $\quad\left\{ \begin{matrix} {{{PSet}_{C}\left( \beta_{0} \right)},} & {\left\lbrack {\beta_{1}\overset{\sim}{\subseteq}\beta_{0}} \right\rbrack\bigwedge\left\lbrack {\beta_{0}\overset{\sim}{\subseteq}\left( {\beta_{1} \cdot {\overset{\sim}{\Psi}}_{1}} \right)} \right\rbrack} \\ {{\{\}},} & {otherwis} \end{matrix} \right.$ PSet_(R0) $\quad\left\{ \begin{matrix} {{{PSet}_{R}\left( {{\beta_{0}\bigcup\limits^{\sim}\beta_{1}},\frac{\alpha}{\beta_{0}\bigcup\limits^{\sim}\beta_{1}}} \right)},} & {\left\lbrack {\beta_{0}\overset{\sim}{\subseteq}\alpha} \right\rbrack\bigwedge\left\lbrack {\beta_{1}\overset{\sim}{\subseteq}\alpha} \right\rbrack} \\ {{\{\}},} & {otherwis} \end{matrix} \right.$ where α := (β₀ · {tilde over (Ψ)}₀) {tilde over (∩)} (β₁ · {tilde over (Ψ)}₁) PSet_(U0) $\quad\left\{ \begin{matrix} {{{PSet}_{R}\left( {{\beta_{0}\bigcup\limits^{\sim}\beta_{1}},\frac{\alpha}{\beta_{0}\bigcup\limits^{\sim}\beta_{1}}} \right)},} & {\beta_{0}\overset{\sim}{\subseteq}\alpha} \\ {{\{\}},} & {otherwis} \end{matrix} \right.$ where α := β₁ · {tilde over (Ψ)}₁ Result matrix intersection PSet_(U1) PSet_(C0) $\quad\left\{ \begin{matrix} {{{PSet}_{C}\left( \beta_{0} \right)},} & {\beta_{1}\overset{\sim}{\subseteq}\beta_{0}} \\ {{\{\}},} & {otherwis} \end{matrix} \right.$ PSet_(R0) $\quad\left\{ \begin{matrix} {{{PSet}_{R}\left( {{\beta_{0}\bigcup\limits^{\sim}\beta_{1}},\frac{\alpha}{\beta_{0}\bigcup\limits^{\sim}\beta_{1}}} \right)},} & {\beta_{1}\overset{\sim}{\subseteq}\alpha} \\ {{\{\}},} & {otherwis} \end{matrix} \right.$ where α := β₀ · {tilde over (Ψ)}₀ PSet_(U0) PSet_(U) (β₀ {tilde over (∪)} β₁)

The operators {tilde over (∪)}, {tilde over (∩)}, and {tilde over (⊆)} are operations on the prime factorizations of natural numbers. The basis of the definitions are the prime factor combinations of the numbers x₀ and x₁:

${x_{0} = {\prod\limits_{i = 1}^{n}\; a_{i}^{e_{i}}}},{x_{1} = {\prod\limits_{j = 1}^{m}\; b_{j}^{l_{j}}}}$

with the prime numbers a_(i), b_(j) ∈

and the exponents e_(i), j_(j)∈

₀.

The result value of an intersecting set on the prime factor level (x₀{tilde over (∪)}x₁) contains all mutual prime factor bases, in each case with the minimum exponents. The result value of a union set on the prime factor level (x₀{tilde over (∩)}x₁) contains all prime factor bases of x₀ and x₁ with the maximum exponents in each case. For a subset on the prime factor level (x₀{tilde over (⊆)}x₁), a set x₀ is a subset of x₁ when x₁ contains at least all prime factor bases of the set x₀ and has exponents with an absolute value at least as high.

A resolution set object QSet, QSet object, is a set object that describes a set of rational resolutions by one PSet object each for the numerator PSet_(nom) and the denominator PSet_(den), optionally in an enveloping interval Q_(Limit) with interval limits Q_(min) and Q_(max). This means that a QSet resolution set thus contains the following information: numerator set object PSet_(nom), denominator set object PSet_(den), and optionally an enveloping interval Q_(Limit)=[Q_(min), Q_(max)], where Q_(min), Q_(max)∈

⁺:

${{QSet}\left( {{PSet}_{nom},{PSet}_{den},Q_{Limits}} \right)}:=\left\{ {\left. {x \in {\mathbb{Q}}^{+}} \middle| x \right. = {{\frac{x_{0}}{x_{1}}\bigwedge x_{0}} \in {{PSet}_{nom}\bigwedge x_{1}} \in {{{PSet}_{den}\bigwedge Q_{\min}} \leq x \leq Q_{\max}}}} \right\}$

The elements of the QSet set result from dividing each element of the numerator set by any other given element of the denominator set, provided that the result lies within the optionally specified enveloping interval. Examples of abstract resolution sets (simplified presentation in rational form, and in the present case, without an enveloping interval) are provided in the following table:

QSet Set elements ${QSet}_{1} = \frac{{PSet}_{C}\left( 5^{1} \right)}{{PSet}_{C}\left( 2^{1} \right)}$ {2⁻¹ · 5¹} ${QSet}_{2} = \frac{{PSet}_{R}\left( {5^{1},2^{2}} \right)}{{PSet}_{C}\left( 1^{1} \right)}$ {5¹, 5¹ · 2¹, 5¹ · 2²} ${QSet}_{3} = \frac{{PSet}_{R}\left( {5^{1},2^{2}} \right)}{{PSet}_{R}\left( {3^{1},2^{1}} \right)}$ {2⁻¹ · 3⁻¹ · 5¹, 2⁶ · 3⁻¹ · 5¹, 2¹ · 3⁻¹ · 5¹, 2² · 3⁻¹ · 5¹} ${QSet}_{4} = \frac{{PSet}_{U}\left( 5^{1} \right)}{{PSet}_{C}\left( 1^{1} \right)}$ {5¹, 2¹ · 5¹, 3¹ · 5¹, 2² · 5¹, 5², 2¹ · 3¹ · 5¹, . . . }

Operations on QSet objects are carried out based on the “product” and “intersecting set” operations defined for PSet objects. The QSet inversion operation QSet brings about the inversion of all elements (resolutions) of the input set. The numerator PSet_(nom) and the denominator PSet_(den) of the set to be inverted are exchanged to form the result. The rational limits of the enveloping interval O_(Limit) are inverted by reversal. The operation QSet product QSet₁·QSet₂ gives a result QSet object, which in its set representation contains all products of element combinations of the set QSet₁ with those of the set QSet₂. The numerator PSet objects of the operands Q_(Set,1) and Q_(Set,2) are multiplied by the PSet product operation in order to calculate the numerator object of the result. An analogous procedure is followed for the denominator PSet objects. A corresponding multiplication based on interval arithmetic is carried out for the enveloping interval. The operation division QSet₁/QSet₂ maps the division of all elements (resolutions) of QSet₁ with those of the set QSet₂. The division is carried out using the inversion and product operations:

$\frac{{QSet}_{1}}{{QSet}_{2}}:={{QSet}_{1} \cdot \overset{\_}{{QSet}_{2}}}$

The enveloping interval is divided using interval arithmetic.

The intersecting set operation QSet₁∩QSet₂ calculates the intersecting set of two input sets. The result object is calculated from the intersecting set of the two numerator PSet objects for determining the result numerator, and of the two denominator PSet objects for determining the result denominator. The enveloping interval of the result is obtained from the intersection of the input enveloping intervals. If the resulting numerator or denominator term represents an empty set, the intersection result is likewise an empty set. The prerequisite for correct results is a preceding normalization of the numerator and denominator PSet objects, in which mutually shortenable components of the bases 3 are determined, and are in each case converted into a variable component for both objects. A result set is an empty set when it contains no element in the enveloping interval Q_(Limit).

In an integer-scaled model, adaptations of signal resolutions are necessary at certain points in order to satisfy the mathematical relationships of fixed-point arithmetic and to conform to maximum bit widths of the target platform. This procedure is referred to as rescaling. With reference to the set algebra described herein, transformations of QSet objects are to be carried out.

It is assumed that within the scope of the integer scaling of a linking, each integer signal S has an associated resolution q_(s)∈

⁺, and the physical signal value p_(s)∈

can be calculated from the integer signal value i_(s) ∈

of the integer signal, using the rule p_(s)=q_(s)·i_(s), that signal rescalings R(S₁, S₂)=R(q_(s1), q_(s2))=q_(s1)/q_(s2), with R∈

⁺, on the target platform result in an expenditure of technical resources that is a direct function of the characteristics of the rational factor R, and that rescalings are to be carried out on the target platform without approximations of the factor R.

Forward transformations VT_(i) are defined for a given target platform. For an input object QSet₀, each transformation VT_(i) gives an associated output object QSet_(i): QSet₁=VT_(i)(QSet₀). The output object QSet_(i) includes all resolutions after transformation of the input resolutions using the rescaling strategy defined by VT_(i). The strategy of a forward transformation VT_(i) maps properties of the factor R, and thus creates defined resource requirements on the target platform.

Rescaling Forward transformation VT_(i)(QSet₀) → QSet_(i) ID No rescaling VT_(ID)(QSet₀) := QSet₀ LS Left shift in VT_(LS)(QSet₀) := QSet₀ · code QSet(PSet_(C)(1), PSet_(R)(1, 2¹⁶), Q_(Limits)) RS Right shift in VT_(RS)(QSet₀) := QSet₀ · code QSet(PSet_(R)(1), PSet_(C)(1, 2¹⁶), Q_(Limits)) MUL Multiplcation in VT_(MUL)(QSet₀) := QSet₀ · code QSet(PSet_(C)(1), PSet_(U)(1), Q_(Limits)) DIV Division in VT_(DIV)(QSet₀) := QSet₀ · code QSet(PSet_(U)(1), PSet_(C)(1), Q_(Limits)) MUL_RS Multiplication VT_(MUL)_RS(QSet₀) := VT_(RS)(VT_(MUL)(QSet₀)) with subsequent right shift in code MUL_DV Multiplication VT_(MUL)_DIV(QSet₀) := VT_(DIV)(VT_(MUL)(QSet₀)) with subsequent division shift in code

As an example, shift operations with up to 16 bit positions are made possible. The enveloping interval Q_(Limits) allows the size of the rescaling factor R to be limited. The transformation set VT={VT₀, VT₁, . . . , VT_(n)} includes all allowed transformations (rescalings) for the integer scaling. An example of forward transformations of a QSet object with VT={VT_(ID), VT_(LS), VT_(MUL), VT_(DIV)} is illustrated in FIG. 1.

A forward transformation, starting from an input resolution set, determines the target resolutions for a defined rescaling rule, for example a right shift, whereas the backward transformation VT_(i) ⁻¹ determines the step that is the inverse thereof. For a resolution target set QSet₀, a determination is made as to which initial resolution set could have resulted in this target set, taking into account the associated forward transformation VT_(i). For each forward transformation VT_(i), a corresponding backward transformation VT_(i) ⁻¹ must be defined.

The resolution set Q maps the combination of all resolutions, which is represented by a set of QSet objects:

${Q\left( {{QSet}_{0},{QSet}_{1},\ldots \;,{QSet}_{n}} \right)}:={\bigcup\limits_{i = 0}^{n}{QSet}_{i}}$

A resolution set is completely defined by the set of its associated QSet objects.

The operations defined for QSet objects may be carried out on a resolution set Q by performing the particular operation element by element on the underlying QSet objects for Q. The resulting set of the result QSet objects forms a new resolution set Q.

For example, this means that an intersecting set formation of resolution sets Q_(A∩B)=Q_(A) ∩Q_(B) takes place via the intersection of all combinations of QSet objects composed of Q_(A) with the QSet objects composed of Q_(B).

In addition, a union set Q₀=Q₁ ∪Q₂ is defined. The result set Q₀ in its abstract representation contains all QSet elements of the set Q₁ and all QSet elements of the set Q₂.

The explanation of definitions of sets and operations underlying the preferred embodiment is now followed by a description of the stated embodiment of the integer scaling method according to the invention, which carries out a calculation of signal resolutions for a given linking. Reference is made to an example of a linking which is not restricting or limiting, but, rather, is merely illustrative for better understanding.

The components of linkings are explained with the aid of the linking by way of example with variables D shown in FIG. 2. Each operator has input-side and output-side pins. One resolution q_(i) is associated with each pin P_(i) of a scaled model. A rescaling takes place when the resolution q₁ at the start of an edge differs from the resolution q₂ at the end of an edge.

Secondary conditions of the fixed-point arithmetic which must be satisfied apply for the resolutions of an integer-scaled model, so that the scaled model calculates physically correct results. Several examples of secondary conditions are presented in the following table:

Operator Secondary conditions Addition All pins of the operator have the same resolution Subtraction All pins of the operator have the same resolution Multiplication The output-side resolution corresponds to the product of the input-side resolutions Division The output-side resolution corresponds to the numerator resolution divided by the denominator resolution

The aim of the particularly preferred embodiment of the method for integer scaling is to determine a resolution at each pin of the linking. The following criteria are taken into account: At each pin, the resolution is neither above nor below the specified resolution limits. Resolution limits may be used to specify minimum accuracies and maximum bit widths that must be adhered to in order to avoid integer overflows. The secondary conditions of the fixed-point arithmetic are satisfied in order for the integer-scaled model to calculate physically correct result values. The number and characteristics of rescalings are optimized based on a cost function in order to minimize the resource requirements of the model on the target platform. The final determined resolution on a pin must be an element of an initial resolution set of this pin. Initial sets may be used to fix unchangeable model portions or to control the characteristics of solutions.

In the particularly preferred embodiment of the method according to the invention for integer scaling described here, the above-defined set objects uses for efficiently depicting rescalings in representations, using finitely large and infinitely large resolution sets uses FIG. 3 illustrates a flow chart of the stated embodiment.

After the start 10, during the initialization 12 an initial resolution set Q_(i) (QSet₀, QSet₁, . . . , QSet_(n)) is assigned to each pin P_(i). The initial resolution set Q_(i) fixes the solution space and the primary factor characteristic of a potential solution on the pin P_(i). A pin whose resolution is to be unchangeable is initialized with a fixed resolution, i.e., with a QSet element comprising a PSet_(C) numerator and a PSet_(C) denominator. A pin whose resolution is allowed to be arbitrary is initialized with a QSet element comprising a PSet_(U) (1) numerator and a PSet_(U) (1) denominator. Other limiting initial sets are possible if necessary.

The resolution limits of the solution space are determined in advance by use of a suitable method, for example to ensure adherence to maximum signal bit widths or to achieve physical minimum accuracies of the integer scaling.

The specific linking shown in FIG. 2 is used as an illustrative example. The following exemplary secondary conditions are present in this example: The resolution of pin 1 is fixed at the value 2 and cannot be changed. The resolution of pin 9 is fixed at the value 1 and cannot be changed. The method is intended to calculate a resolution for pin 0 and pins 2-8. The solution for pin 0 should be a resolution for the prime factor base 2. Only rescalings of the “right shift” type are to be allowed.

The following QSet symbols are defined for a simplified representation:

QSet_(0.5) :=QSet(PSet_(C)(1¹),PSet_(C)(2¹))

QSet₁ :=QSet(PSet_(C)(1¹),PSet_(C)(1¹))

QSet₂ :=QSet(PSet_(C)(2¹),PSet_(C)(1¹))

QSet_(0.5·2) _(−x) :=QSet(PSet_(C)(1¹),PSet_(R)(2¹,2¹⁵))

QSet₂ _(−x) :=QSet(PSet_(C)(1¹),PSet_(R)(1¹,2¹⁶))

QSet_(2·2) _(+x) :=QSet(PSet_(R)(2¹,2¹⁵),PSet_(C)(1¹))

QSet₂ _(±x) :=QSet(PSet_(R)(1¹,2¹⁶),PSet_(C)(1¹,2¹⁶))

QSet_(x) :=QSet(PSet_(U)(1¹),PSet_(U)(1¹))

To simplify the representation, enveloping intervals are not considered: it is assumed that all resolutions are always to be limited to the enveloping interval [2⁻¹⁶ . . . 2⁺¹⁶]. In this example, the set of allowed forward transformations should be VT:={VT_(ID), VT_(RS)}.

In the application of the particularly preferred embodiment of the method according to the invention to the specific linking in FIG. 2, in the initialization 12 phase an initial resolution set Q_(i) is assigned to each pin P_(i), based on the following secondary conditions:

Pin # (i) Initial resolution sets 0 Q_(i)(QSet₂ _(±x) ) 1 Q_(i)(QSet₂) 2-8 Q_(i)(QSet_(x)) 9 Qi(QSet₁)

In the forward propagation 14 phase, the resolution sets are propagated step by step along an edge A from the inputs to the outputs by forward transformations and set intersection operations. From the resolution set Q_(A), at the start of an edge a result resolution set Q_(B)′ is calculated at the end of an edge, using forward transformation VT={VT₀, . . . , VT_(n)}. The resolution set Q_(B)′ is intersected with the existing resolution set based on initialization or a preceding calculation, giving the following:

$Q_{B}:={{Q_{B}\bigcap Q_{B}^{\prime}} = {Q_{B}\bigcap\left( {\bigcup\limits_{i = 0}^{n}{{VT}_{i}\left( Q_{A} \right)}} \right)}}$

The forward propagation 14 at an operator calculates from its input resolution sets the output resolution set. The output resolution set is calculated on an operator-specific basis in order to satisfy secondary conditions of the fixed-point arithmetic. The resolution set calculated for the operator output is intersected by the existing resolution set Q_(i) at this output pin P_(i).

The terms P_(A0), . . . , P_(Am) for the input pins of the operator and the term P_(B) for the output pin of the operator result in the calculation rules provided in the following table:

Operator Calculation rule Addition/subtraction/ Q_(B) := Q_(B) ∩ (∩_(i=0) ^(m) Q_(Ai))| operators with identical pin resolutions Multiplication Q_(B) := Q_(B) ∩ (∩_(i=0) ^(m) Q_(Ai))| Division Q_(B) := Q_(B) ∩ (Q_(A0)/Q_(A1)) with the numerator pin P_(A0) and the denominator pin P_(A1)

For the linking shown by way of example in FIG. 2, a complete phase of the forward propagation 14 is carried out with the forward transformation set VT={VT_(ID),VT_(RS)}. The results of the individual calculation steps are provided in the following table:

Pin # Propagation step Result 1. 3 Propagation, edge 0-3 Q₃ := Q₃ ∩ (VT_(ID)(Q₀) ∪ VT_(RS)(Q₀)) = Q(QSet₂ _(±x) )| 2. 4 Propagation, edge 1-4 Q₄ := Q₄ ∩ (VT_(ID)(Q₁) ∪ VT_(RS)(Q₁)) = Q(QSet₂, QSet_(2·2) _(±x) ) 3. 5 Propagation, addition Q₅ := Q₅ ∩ Q₃ ∩ Q₄ ∩ Q₅ ∩ Q(QSet₂, QSet_(2·2) _(±x) ) operator 4. 6 Propagation, edge 5-6 Q₆ := Q₆ ∩ (VT_(ID)(Q₅) ∪ VT_(RS)(Q₅)) = Q(QSet₂, QSet_(2·2) _(±x) ) 5. 7 Propagation, edge 2-7 Q₇ := Q₇ ∩ (VT_(ID)(Q₂) ∪ VT_(RS)(Q₂)) = Q(QSet_(x)) 6. 8 Propagation, Q₈ := Q₈ ∩ (Q₆ · Q₇) = Q(QSet_(x)) multiplication operator 7. 9 Propagation, edge 8-9 Q₉ := Q₉ ∩ (VT_(ID)(Q₈) ∪ VT_(RS)(Q₈)) = Q(QSet₁)

If an empty resolution set (Q_(i)={ }) exists for a given pin P_(i) of the linking, the embodiment of the method according to the invention immediately terminates, without a result.

The step of backward propagation 16 is carried out analogously to the forward propagation 14, in reverse order and with application of the inverse forward transformations VT_(i) ⁻¹. Based on the resolution set Q_(B) at the end of an edge, a resolution set Q_(A)′ at the start of an edge is calculated along an edge by means of inverse forward transformation VT⁻¹={VT₀ ⁻¹, . . . , VT_(n) ⁻¹}. The resolution set Q_(A)′ is intersected by the existing resolution set Q_(A).

$Q_{A}:={{Q_{A}\bigcap Q_{A}^{\prime}} = {Q_{A}\bigcap\left( {\bigcup\limits_{i = 0}^{n}{{VT}_{i}^{- 1}\left( Q_{B} \right)}} \right)}}$

A backward propagation is carried out for each input of the operator. The terms P_(A0), . . . , P_(Am) for the input pins of the operator and the term P_(B) for the output pin of the operator result in the calculation rules provided in the following table:

Operator Calculation rule for input P_(Ai) Addition/substrac- Q_(Ai) := Q_(Ai) ∩ Q_(B) tion/operators with identical pin resolutions Multiplication Q_(Ai) := Q_(Ai) ∩ (Q_(B)/Π_(0≤j≤m ∀j≠i)Q_(Aj)) Division Q_(A0) := Q_(A0) ∩ (Q_(A1) · Q_(B))| with the numerator pin P_(A0) Q_(A1) := Q_(A1) ∩ (Q_(A0)/Q_(B)) with the denominator pin P_(A1)

For the linking shown by way of example in FIG. 2, a complete phase of the backward propagation 16 is carried out as an example. The results of the individual calculation steps are provided in the following table:

Pin # Propagation step Result 1. 8 Propagation, edge 8-9 Q₈ := Q₈ ∩ (VT_(ID) ⁻¹(Q₉) ∪ VT_(RS) ⁻¹(Q₉)) = Q(QSet₁, QSet₂ _(−x) ) 2. 7 Propagation, Q₇ := Q₇ ∩ (Q₈/Q₆) = Q(QSet_(0.5), QSet_(0.5·2) _(−x) ) multiplication operator 3. 6 Propagation, Q₆ := Q₆ ∩ (Q₈/Q₇) = Q(QSet_(0.5), QSet_(2·2) _(+x) ) multiplication operator 4. 5 Propagation, edge 5-6 Q₅ := Q₅ ∩ (VT_(ID) ⁻¹(Q₆) ∪ VT_(RS) ⁻¹(Q₆)) = Q(QSet₂, QSet_(2·2) _(+x) ) 5. 4 Propagation, addition Q₄ := Q₄ ∩ Q₅ = Q(QSet₂, QSet_(2·2) _(+x) ) operator 6. 3 Propagation, addition Q₃ := Q₃ ∩ Q₅ = Q(QSet₂, QSet_(2·2) _(+x) ) operator 7. 2 Propagation, edge 2-7 Q₂ := Q₂ ∩ (VT_(ID) ⁻¹(Q₇) ∪ VT_(RS) ⁻¹(Q₇)) = Q(QSet_(0.5), QSet_(0.5·2) _(−x) ) 8. 1 Propagation, edge 1-4 Q₁ := Q₁ ∩ (VT_(ID) ⁻¹(Q₄) ∪ VT_(RS) ⁻¹(Q₄)) = Q(QSet₂)| 9. 0 Propagation, edge 0-3 Q₀ := Q₀ ∩ (VT_(ID) ⁻¹(Q₃) ∪ VT_(RS) ⁻¹(Q₃)) = Q(QSet₂, QSet_(2·2) _(+x) )|

Analogously to the forward propagation, the algorithm terminates without a solution if an empty resolution set (Q_(i)={ }) exists for a given pin P; of the model.

This is followed by a stability decision 18: a check is made as to whether the result is stable. The result is stable if, after a cycle comprising forward and backward propagation, the elements of the resolution sets do not differ from the immediately preceding cycle. If this is the case, the first “yes” decision 20 involves a step of solution selection 22. In this step, for an unsolved pin P_(i) a final solution is determined in the linking. A pin P_(i) is unsolved when its assigned resolution set Q_(i) contains at least two resolutions. From the set of unsolved pins in the model, the pin P_(i) to be solved must first be determined. The selection may be made arbitrarily or in favor of a deterministic integer scaling, using a suitable selection strategy, such as a cost analysis of the required transformations. If it is determined in the stability decision 18 that the result is not yet stable (first “no” decision 24), forward propagation 14 and backward propagation are carried out anew (iteration).

In the step of solution selection 22, for the selected pin P_(i) a final resolution is determined from its resolution set Q_(i). In the preferred embodiment according to FIG. 3, the specific procedure for selection of a resolution from Q_(i) encompasses specifying the transformation costs C_(x) for each transformation VT_(x). The costs may be used to place the focus on run time efficiency (computer-intensive rescalings entail high costs) or memory efficiency (memory-intensive rescalings entail high costs). An iteration is made over all QSetobjects of the resolution set Q_(i) (QSet₀, . . . , QSet_(n)). The costs of all transformations in the model that are necessary at least for the existence of the QSet element under consideration are determined. The QSet object QSet* with the lowest costs is selected. A resolution q*∈QSet* is selected from QSet* and converted into a new resolution set Q_(i) whose single represented resolution is the selected resolution q*.

A consideration is subsequently made in a completeness decision 26 as to whether there are further unsolved pins. If further unsolved pins exist in the linking (second “no” decision 30), forward propagation 14 and backward propagation 16 must be carried out anew until stabilization is achieved, before the next pin can be reliably solved. In contrast, if all pins are solved (second “yes” decision 28), the integer scaling is completely terminated and the embodiment of the method reaches the end 32.

For an exemplary illustration with regard to the linking shown in FIG. 2, the unsolved pin P₂ is selected by way of example. The pin P₂ is unsolved, since the resolution set Q₂, due to two contained QSet objects, maps at least two specific resolutions. Cost values for the allowed transformations VT:={VT_(ID),VT_(RS)} are defined as follows:

Transformation Costs C_(x) VT_(ID) 0 VT_(RS) 1

The starting points are the results of the preceding phases of the propagation for the linking in FIG. 2:

Pin # Result, resolution set 0 Q₀ = Q(QSet₂, QSet_(2·2) _(+x) ) 1 Q₁ = Q(QSet₂) 2 Q₂ = Q(QSet_(0.5), QSet_(2·2) _(−x) ) 3 Q₃ = Q(QSet₂, QSet_(2·2) _(+x) ) 4 Q₄ = Q(QSet₂, QSet_(2·2) _(+x) ) 5 Q₅ = Q(QSet₂, QSet_(2·2) _(+x) ) 6 Q₆ = Q(QSet₂, QSet_(2·2) _(+x) ) 7 Q₇ = Q(QSet₁, QSet_(0.5·2) _(−x) ) 8 Q₀ = Q(QSet₁, QSet₂ _(−x) ) 9 Q₉ = Q(QSet₁)

The costs of an object QSet_(j) at a pin may be determined over the totality of transformations carried out in the linking that have resulted in the existence of this object QSet_(j). The specific characteristic of such a cost calculation is not specified by the set algebra used by the scaling method described in the embodiment.

The following expression applies: C_(T) (P₂, QSet_(0.5))=0 Õ. The element QSet_(0.5) requires only transformations of type VT_(ID) for its existence at pin 2. The following expression applies: C_(T) (P₂, QSet_(0.5*2) _(−x) )=1 Õ. The element 0.5·2^(−x) requires at least one VT_(ID) transformation in the linking for its existence at pin 2. The element QSet_(0.5) is selected. Each represented resolution of this QSet element may be selected without adversely affecting the resources. Since the element already represents a specific resolution (q=0.5), no further selection is necessary. The result is Q₂:=Q₂(QSet_(0.5)). Since further unsolved pins exist in the linking shown in FIG. 2, a new propagation phase is started with the adapted resolution set Q₂.

LIST OF REFERENCE SYMBOLS

-   10 start -   12 initialization -   14 forward propagation -   16 backward propagation -   18 stability decision -   20 first “yes” decision -   22 solution selection -   24 first “no” decision -   26 completeness decision -   28 second “yes” decision -   30 second “no” decision -   32 end -   A edge -   B operator -   C pin -   D variable 

1. A method for determining a value of an integer scaling in a linking of input sets to output sets, wherein the linking comprises operators, each of which has operator inputs and operator outputs that are at least partially linked to one another or to the input sets or to the output sets, wherein a computer device has a processing unit, a memory unit, and an output unit is used, and in each case a representation of the effect of each of the operators on the particular integer scaling of its operator inputs is provided for generating the particular integer scaling of its operator outputs, wherein the method comprises: storing, for each input set, each operator input, each operator output, and each output set, an initial representation of the set of all allowed integer scalings and a representation of a rescaling of an integer scaling to a set of all integer scalings, which are achievable by allowable transformations, in each case in the memory unit, propagating forward the initial representations of the input sets through the linking, so that, for each operator input, for each operator output, and for each output set, a representation of the set of all possible integer scalings is generated in the processing unit, wherein, according to the connections in the linking, and consistent with the initial representations for each translation of an input set to an operator input, the representation of the rescaling is applied, for each translation of an operator output to an operator input or to an output set, the representation of the rescaling is applied, and for each operator, the representation of its effect is applied, and specifying one element from one of the generated sets as the value of the integer scaling, based on a selection that is made in an automated manner in the processing unit, and outputting the specified value in the output unit.
 2. The method for determining a value of an integer scaling in a linking of input sets to output sets according to claim 1, wherein the step of propagating forward comprises intersecting each representation obtained in one of the translations at an operator input with the representation at this operator input, intersecting each representation obtained by operator application at an operator output with the representation at this operator output, and intersecting each representation obtained for an output set with the representation of this output set.
 3. The method for determining a value of an integer scaling in a linking of input sets to output sets according to claim 1, wherein the representations are based on prime factor sets having a finite number or an infinite number of prime factor combinations.
 4. The method for determining a value of an integer scaling in a linking of input sets to output sets according to claim 3, wherein the representations are composed of union sets of sets of quotients from elements of prime factor sets.
 5. The method for determining a value of an integer scaling in a linking of input sets to output sets according to one of the preceding claims claim 1, further comprising: after the forward propagation and prior to the determination of an element, propagating the generated representations of the output sets backward through the linking, so that for each operator input, for each operator output, and for each input set, a representation of the set of all possible integer scalings is generated in the processing unit, wherein according to the connections in the linking, and consistent with the representations obtained in the forward propagation, for each translation of an output set to an operator output, the representation of the inverse rescaling is applied, and for each translation of an operator input to an operator output or to an input set, the representation of the inverse rescaling is applied, and for each operator, the representation of its inverse effect is applied.
 6. The method for determining a value of an integer scaling in a linking of input sets to output sets according to claim 5, further comprising: comparing the representations generated by forward propagation to the representations generated by backward propagation, and further forward propagating if a backward propagation most recently took place, or a further backward propagating if a forward propagation most recently took place, until the representations generated by the most recent forward propagation no longer differ from the representations generated by the most recent backward propagation.
 7. The method for determining a value of an integer scaling in a linking of input sets to output sets according to claim 1, further comprising: after the element is determined from the one generated set, projecting the generated representation of the set onto the representation of the element, based on the other generated representations and the representation of the element, carrying out at least one new propagation, and fixing a further element from one of the other sets that is generated after this new propagation as the value of the integer scaling at another location in the linking, based on a selection that is made in an automated manner in the processing unit, and outputting the fixed further value in the output unit.
 8. The method for determining a value of an integer scaling in a linking of input sets to output sets according to claim 1, wherein the selection that is made in an automated manner in the processing unit comprises: assessing the elements of the generated set of the integer scalings with a cost function, and determining the element to be selected based on its associated costs.
 9. The method for determining a value of an integer scaling in a linking of input sets to output sets according to claim 1, further comprising: selecting allowable transformations from a set of possible transformations before the representation of the rescaling of an integer scaling is created or selected for the set of all integer scalings, and storing the selected allowable transformations in the memory.
 10. A computer program product that may be loaded directly into the internal memory of a computer, comprising: software code sections with which a method according to claim 1 is carried out when the computer program product runs on the computer. 